package com.example.leetcode.array;

import com.example.leetcode.array.common.ArrayUtils;

class Solution128 {
    public int longestConsecutive(int[] nums) {
        return ArrayUtils.longestConsecutive(nums);
    }
}

public class leetcode128 {
    public static void main(String[] args) {
        Solution128 solution128 = new Solution128();
        int[] nums = {100, 4, 200, 1, 3, 2};
        System.out.println(solution128.longestConsecutive(nums));
    }
}
